


@BOOK{laplante2001dictionary,
    AUTHOR       = "Phillip A. Laplante",
    TITLE        = "Dictionary of computer science, engineering, and technology",
    PUBLISHER    = "CRC Press",
    YEAR         = "2001"
}

@book{corman1990algorithms,
    author = {Thomas  H. Cormen, Charles  E. Leiserson, Ronald  L. Rivest and Clifford Stein },
    publisher = {{The MIT Press}},
    title = {Introduction to Algorithms},
    year = {1990}
}

@article{hart1968aFormalBasis,
       author=" P. E. Hart, N. J. Nilsson and B. Raphael",
       title="A formal basis for the heuristic determination of
          minimum cost paths",
       journal="IEEE Transactions on Systems Science and Cybernetics",
       volume="SSC-4(2)",
       pages="100-107",
       year=1968}

@article{dechter1985generalizedBestFirst,
       author="R. Dechter and J. Pearl",
       title="Generalized best-first search strategies and the
         optimality of {A}*",
       journal="Journal of the Association for Computing Machinery",
       volume="32(3)",
       pages="505-536",
       year=1985}

@article{dijkstra1959aNoteOn,
       author="E. W. Dijkstra",
       title="A note on two problems in connexion with graphs",
       journal="{\it Numerische Mathematik}",
       volume="1",
       pages="269-271",
       year=1959}



 @article{korf1985depthFirstIterative,
   author="R. E. Korf",
       title="Depth-first iterative-deepening: An optimal admissible tree
search",
       journal="Artificial Intelligence",
       volume="27(1)",
       pages=" 97-109",
       year=1985 }

@article{korf1993linearSpaceBest,
   author="R. E. Korf",
       title=" Linear-space best-first search",
       journal="Artificial Intelligence",
       volume="62(1)",
       pages="41--78",
       year= 1993}

@article{chakrabarti1989heuristicSearchIn,  
	author ={P. P. Chakrabarti and S. Ghose and A. Acharya and S. C. de Sarkar},  
	title = {Heuristic Search in Restricted Memory},  
	journal = {Artificial Intelligence},  
	year = {1989}, 
	volume = {41},  
	number = {2},  
	pages = {197--221}
}


@article{russell1992efficientMemoryBounded,
   author="S. J. Russell",
       title="Efficient memory-bounded search methods",
       journal="Proc of ECAI-92",
       year= 1992,
       address="Viena, Austria"}


@INPROCEEDINGS{likhachev2004ara*:anytime,
    author = {Maxim Likhachev and Geoff Gordon and Sebastian Thrun},
    title = {ARA*: Anytime A* with provable bounds on sub-optimality},
    booktitle = {Advances in Neural Information Processing Systems 16: Proceedings of the 2003 Conference (NIPS-03)},
    year = {2004},
    publisher = {MIT Press}
}

@article{hansen2007anytimeHeuristic,
  author    = {Eric A. Hansen and
               Rong Zhou},
  title     = {Anytime Heuristic Search},
  journal   = {J. Artif. Intell. Res. (JAIR)},
  volume    = {28},
  year      = {2007},
  pages     = {267-297}
}

@article{ikeda1999EnahncedA,
 author = {Takahiro Ikeda and Hiroshi Imai},
 title = {Enhanced A algorithms for multiple alignments: optimal alignments for several sequences and k-opt approximate alignments for large cases},
 journal = {Theor. Comput. Sci.},
 volume = {210},
 number = {2},
 year = {1999},
 issn = {0304-3975},
 pages = {341--374},
 doi = {http://dx.doi.org/10.1016/S0304-3975(98)00093-0},
 publisher = {Elsevier Science Publishers Ltd.},
 address = {Essex, UK},
 }


@inproceedings{sen1989fastRecursiveFormulation,
   author="A. Sen and A. Bagchi",
       title=" Fast recursive formulations for best-first search that
         allow controlled use of memory",
       booktitle="Proceedings of IJCAI-89",
       pages="297-302",
       year= 1989,
       address=" Detroit, MI"}

@INPROCEEDINGS{zhou2003sparseMemoryGraph,
    author = {Rong Zhou and Eric A. Hansen},
    title = {Sparse-memory graph search},
    booktitle = {Proceedings of the 18th International Joint Conference on Artificial Intelligence (IJCAI-03)},
    year = {2003},
    pages = {1259--1268}
}


@inproceedings{DUAL2005,
  author    = {Ariel Felner and
               Uzi Zahavi and
               Jonathan Schaeffer and
               Robert C. Holte},
  title     = {Dual Lookups in Pattern Databases},
  booktitle = {IJCAI},
  year      = {2005},
  pages     = {103-108},
}

@inproceedings{ICAPS09,
  author    = {Z. Zhang and
               Jonathan Schaeffer and
               Nathan R. Sturtevant and Robert Holte and Ariel Felner},
  title     = {A* search with Inconsistent Heuristics},
  booktitle = {IJCAI},
  year      = {2009},
  pages     = {to appear}
}


@article{korf2008linearTimeDisk,
 author = {Korf,, Richard E.},
 title = {Linear-time disk-based implicit graph search},
 journal = {J. ACM},
 volume = {55},
 number = {6},
 year = {2008},
 pages = {1--40},
 publisher = {ACM},
 address = {New York, NY, USA}
 }


@article{ADBAIJ02,
  author    = {Richard E. Korf and
               Ariel Felner},
  title     = {Disjoint pattern database heuristics},
  journal   = {Artif. Intell.},
  volume    = {134},
  number    = {1-2},
  year      = {2002},
  pages     = {9-22}
}


@inproceedings{INCON2007,
  author    = {Uzi Zahavi and
               Ariel Felner and
               Jonathan Schaeffer and
               Nathan R. Sturtevant},
  title     = {Inconsistent Heuristics},
  booktitle = {AAAI},
  year      = {2007},
  pages     = {1211-1216},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}


@book{russel2003modern,
	author = {Russell, Stuart  J.  and Norvig, Peter  },
	publisher = {Pearson Education},
	title = {Artificial Intelligence: A Modern Approach},
	year = {2003}
}
